{"componentChunkName":"component---src-templates-post-jsx","path":"/[BOJ]20922/","result":{"data":{"site":{"siteMetadata":{"title":"SUbbb"}},"markdownRemark":{"id":"fef58615-9e18-5f50-8d09-3d1e2839342f","excerpt":"문제 BOJ - 겹치는 건 싫어 📍 Logic  을 이용해 해당 숫자가 문자열에 나타난 횟수를 저장한다. 이미  개가 문자열에 들어있다면,  지점에 있는 숫자부터 1개씩 줄여나간다.  에서 -1하고,  를 1씩 증가시킨다. 아직  개가 문자열에 들어있지 않다면, 나타난 횟수를 1씩 증가시킨다. 아직 문자열에 들어있지 않은 경우와  개가 문자열에 들어있지 …","html":"<h2>문제</h2>\n<p><a href=\"https://www.acmicpc.net/problem/20922\">BOJ - 겹치는 건 싫어</a></p>\n<h3>📍 <strong>Logic</strong></h3>\n<deckgo-highlight-code language=\"java\" terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">while(s &lt;= e) {\n    if (e == numbers.length) {\n        max = Math.max(max, e - s);\n        break;\n    }\n    int n = numbers[e];\n\n    if (numMap.containsKey(n)) {\n        if (numMap.get(n) == K) {\n            max = Math.max(max, e - s);\n            int count = numMap.get(numbers[s]) - 1;\n            if (count == 0) numMap.remove(numbers[s]);\n            else numMap.put(numbers[s], count);\n            s++;\n        } else {\n            numMap.put(n, numMap.getOrDefault(n, 0) + 1);\n            e++;\n        }\n    } else {\n        numMap.put(n, 1);\n        e++;\n    }\n}</code>\n        </deckgo-highlight-code>\n<ul>\n<li><code class=\"language-text\">Map</code> 을 이용해 해당 숫자가 문자열에 나타난 횟수를 저장한다.</li>\n<li>\n<p>이미 <code class=\"language-text\">K</code> 개가 문자열에 들어있다면, <code class=\"language-text\">s</code> 지점에 있는 숫자부터 1개씩 줄여나간다.</p>\n<ul>\n<li><code class=\"language-text\">Map</code> 에서 -1하고, <code class=\"language-text\">s</code> 를 1씩 증가시킨다.</li>\n</ul>\n</li>\n<li>아직 <code class=\"language-text\">K</code> 개가 문자열에 들어있지 않다면, 나타난 횟수를 1씩 증가시킨다.</li>\n<li>아직 문자열에 들어있지 않은 경우와 <code class=\"language-text\">K</code> 개가 문자열에 들어있지 않은 경우만 <code class=\"language-text\">e</code> 를 증가시켜 다음 숫자를 확인할 수 있도록 한다.</li>\n</ul>\n<h3>📄 <strong>CODE</strong></h3>\n<details>\n  <summary>코드 보기/접기💫</summary>\n    <div markdown=\"1\">\n<deckgo-highlight-code  terminal=\"carbon\" theme=\"a11y-dark\" line-numbers=\"true\"  >\n          <code slot=\"code\">import java.io.BufferedReader;\nimport java.io.IOException;\nimport java.io.InputStreamReader;\nimport java.lang.reflect.Array;\nimport java.util.*;\nimport java.util.regex.Matcher;\nimport java.util.regex.Pattern;\n\n\nclass Main {\n    public static void main(String[] args) throws IOException {\n        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n        int[] info = Arrays.stream(br.readLine().split(&quot; &quot;)).mapToInt(Integer::parseInt).toArray();\n        int N = info[0];\n        int K = info[1];\n        int s = 0;\n        int e = 0;\n        int max = 0;\n        Map&lt;Integer, Integer&gt; numMap = new HashMap&lt;&gt;();\n\n        int[] numbers = Arrays.stream(br.readLine().split(&quot; &quot;)).mapToInt(Integer::parseInt).toArray();\n\n        while(s &lt;= e) {\n            if (e == numbers.length) {\n                max = Math.max(max, e - s);\n                break;\n            }\n            int n = numbers[e];\n\n            if (numMap.containsKey(n)) {\n                if (numMap.get(n) == K) {\n                    max = Math.max(max, e - s);\n                    int count = numMap.get(numbers[s]) - 1;\n                    if (count == 0) numMap.remove(numbers[s]);\n                    else numMap.put(numbers[s], count);\n                    s++;\n                } else {\n                    numMap.put(n, numMap.getOrDefault(n, 0) + 1);\n                    e++;\n                }\n            } else {\n                numMap.put(n, 1);\n                e++;\n            }\n        }\n\n        System.out.println(max);\n    }\n}</code>\n        </deckgo-highlight-code>\n  \t</div>\n</details>\n<h3>✏️ <strong>Review</strong></h3>\n<ul>\n<li>투 포인터를 사용하는 문제 중 그나마 쉬워보여서 푼 문제</li>\n<li><code class=\"language-text\">s</code> 와 <code class=\"language-text\">e</code> 에 대한 착각으로 시간이 좀 걸렸다...</li>\n</ul>\n<h3>📕 출처</h3>\n<p>Baekjoon : <a href=\"https://www.acmicpc.net/problem/17779\">https://www.acmicpc.net/problem/17779</a></p>","frontmatter":{"title":"👩‍💻 20922. 겹치는 건 싫어","date":"May 28, 2022","update":"May 28, 2022","tags":["투 포인터"],"series":"👩‍💻 BOJ"},"fields":{"slug":"/[BOJ]20922/","readingTime":{"minutes":2.2}}},"seriesList":{"edges":[{"node":{"id":"27733333-3aad-5771-a1a1-27b4de4b4a01","fields":{"slug":"/[BOJ]2225/"},"frontmatter":{"title":"👩‍💻 2225. 합분해"}}},{"node":{"id":"548ba188-2afe-5575-b79f-107c6c65b07d","fields":{"slug":"/[BOJ]1012/"},"frontmatter":{"title":"👩‍💻 1012. 유기농 배추"}}},{"node":{"id":"0c712680-130f-5fa5-8c3b-3632dd5d1af0","fields":{"slug":"/[BOJ]1260/"},"frontmatter":{"title":"👩‍💻 1260. DFS와 BFS"}}},{"node":{"id":"0e07a592-06ce-5e01-b5e1-95398330372e","fields":{"slug":"/[BOJ]1707/"},"frontmatter":{"title":"👩‍💻 1707. 이분그래프"}}},{"node":{"id":"df12bfec-ed5c-5fc4-8442-0a4b3f9759a3","fields":{"slug":"/[BOJ]2668/"},"frontmatter":{"title":"👩‍💻 2668. 숫자 고르기"}}},{"node":{"id":"01bbb6dc-812c-5223-87c5-53bf04c0d0a6","fields":{"slug":"/[BOJ]9466/"},"frontmatter":{"title":"👩‍💻 9466. 텀 프로젝트"}}},{"node":{"id":"abc306b3-c3a6-552a-8979-e82d506b3921","fields":{"slug":"/[BOJ]2146/"},"frontmatter":{"title":"👩‍💻 2146. 다리 만들기"}}},{"node":{"id":"b3394e53-5e9a-595e-8da4-bb3debd220c0","fields":{"slug":"/[BOJ]5014/"},"frontmatter":{"title":"👩‍💻 5014. 스타트 링크"}}},{"node":{"id":"be297703-e778-5727-8019-6954bc95da3a","fields":{"slug":"/[BOJ]11559/"},"frontmatter":{"title":"👩‍💻 11559. Puyo Puyo"}}},{"node":{"id":"ddf11545-d468-5269-94b1-5daa2720e886","fields":{"slug":"/[BOJ]17471/"},"frontmatter":{"title":"👩‍💻 17471. 게리맨더링"}}},{"node":{"id":"8d77114d-fc6e-5de2-a3ca-c3b250425a56","fields":{"slug":"/[BOJ]2437/"},"frontmatter":{"title":"👩‍💻 2437. 저울"}}},{"node":{"id":"9a8942ce-552f-51ae-b304-0d0fab8f2eba","fields":{"slug":"/[BOJ]14891/"},"frontmatter":{"title":"👩‍💻 14891. 톱니바퀴"}}},{"node":{"id":"f1c04e8a-df0a-5294-949f-5f3a483cbcb0","fields":{"slug":"/[BOJ]14503/"},"frontmatter":{"title":"👩‍💻 14503. 로봇 청소기"}}},{"node":{"id":"883b6ecf-7528-5c16-92fa-edf12a64e80e","fields":{"slug":"/[BOJ]3190/"},"frontmatter":{"title":"👩‍💻 3190. 뱀"}}},{"node":{"id":"099b2576-7d05-5872-a9f0-f1ee6efd3a9a","fields":{"slug":"/[BOJ]14502/"},"frontmatter":{"title":"👩‍💻 14502. 연구소"}}},{"node":{"id":"50eef059-4e55-5f14-a9cf-fb01b6506f02","fields":{"slug":"/[BOJ]17779/"},"frontmatter":{"title":"👩‍💻 17779. 게리맨더링 2"}}},{"node":{"id":"aa67d90b-4801-574c-b225-56c23737a5e2","fields":{"slug":"/[BOJ]2579/"},"frontmatter":{"title":"👩‍💻 2579. 계단 오르기"}}},{"node":{"id":"9db6b43b-963a-5ebd-b72b-69936cf37858","fields":{"slug":"/[BOJ]14499/"},"frontmatter":{"title":"👩‍💻 14499. 주사위 굴리기"}}},{"node":{"id":"6a79cddd-dc1b-5e34-8a84-af313c37de0e","fields":{"slug":"/[BOJ]15685/"},"frontmatter":{"title":"👩‍💻 15685. 드래곤 커브"}}},{"node":{"id":"5e001d34-d985-545b-83ec-7f1c7caea286","fields":{"slug":"/[BOJ]17144/"},"frontmatter":{"title":"👩‍💻 17144. 미세먼지 안녕!"}}},{"node":{"id":"1d132410-9377-5e55-85b9-4664ff64de73","fields":{"slug":"/[BOJ]9935/"},"frontmatter":{"title":"👩‍💻 9935. 문자열 폭발"}}},{"node":{"id":"e13ff8d6-9b02-56c0-83e2-1d3144f70e1d","fields":{"slug":"/[BOJ]16472/"},"frontmatter":{"title":"👩‍💻 16472. 고냥이"}}},{"node":{"id":"0f782160-aaa9-5c54-80c0-72a15172dd16","fields":{"slug":"/[BOJ]1083/"},"frontmatter":{"title":"👩‍💻 1083. 소트"}}},{"node":{"id":"fef58615-9e18-5f50-8d09-3d1e2839342f","fields":{"slug":"/[BOJ]20922/"},"frontmatter":{"title":"👩‍💻 20922. 겹치는 건 싫어"}}},{"node":{"id":"7ca89240-c65f-5cb4-aeef-c5f1605ebd00","fields":{"slug":"/[BOJ]16172/"},"frontmatter":{"title":"👩‍💻 16172. 나는 친구가 적다(Large)"}}}]},"previous":{"fields":{"slug":"/[Programmers]17685/"},"frontmatter":{"title":"👩‍💻 17685. 자동완성"}},"next":{"fields":{"slug":"/[CS]이진탐색트리/"},"frontmatter":{"title":"📂 이진탐색트리(Binary Search Tree)"}}},"pageContext":{"id":"fef58615-9e18-5f50-8d09-3d1e2839342f","series":"👩‍💻 BOJ","previousPostId":"80b89715-56df-5218-ba61-abbd1b74ce83","nextPostId":"2efb6036-05bf-594e-b9b5-03e399be6f78"}},"staticQueryHashes":[]}